Sciweavers

238 search results - page 42 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
IFM
2004
Springer
175views Formal Methods» more  IFM 2004»
15 years 3 months ago
State/Event-Based Software Model Checking
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
Sagar Chaki, Edmund M. Clarke, Joël Ouaknine,...
TPHOL
2009
IEEE
15 years 4 months ago
Psi-calculi in Isabelle
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
Jesper Bengtson, Joachim Parrow
CSL
2001
Springer
15 years 2 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
14 years 11 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
FASE
2006
Springer
15 years 1 months ago
Concerned About Separation
Abstract. The separation of concerns, as a conceptual tool, enables us to manage the complexity of the software systems that we develop. There have been a number of approaches aime...
Hafedh Mili, Houari A. Sahraoui, Hakim Lounis, Ham...