4595 search results - page 248 / 919 » Reasoning about Plans |
166
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
196
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structur...
177
click to vote
FMCO
2004
Springer
16 years 20 days ago
2004
Springer
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
189
click to vote
MPC
2010
Springer
16 years 1 days ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
188
click to vote
COORDINATION
2008
Springer
15 years 9 months ago
2008
Springer
A translation of the Business Process Modeling Notation into the process calculus COWS is presented. The stochastic extension of COWS is then exploited to address quantitative reas...