Sciweavers

624 search results - page 89 / 125
» Reasoning with Expressive Description Logics: Theory and Pra...
Sort
View
PLDI
2011
ACM
12 years 11 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
LPAR
2004
Springer
14 years 2 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CADE
2006
Springer
14 years 12 days ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
ECBS
2008
IEEE
124views Hardware» more  ECBS 2008»
13 years 10 months ago
Hierarchical Model to Develop Component-Based Systems
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
Abdelkrim Amirat, Mourad Oussalah
ATAL
1995
Springer
14 years 6 days ago
Time, Knowledge, and Choice
Abstract. This article considers the link between theory and practice in agentoriented programming. We begin by rigorously defining a new formal specification language for autono...
Michael Wooldridge