Sciweavers

453 search results - page 72 / 91
» Geometric logic as a Specification Language
Sort
View
CAV
1997
Springer
102views Hardware» more  CAV 1997»
15 years 3 months ago
Efficient Model Checking Using Tabled Resolution
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramak...
MKWI
2008
150views Business» more  MKWI 2008»
15 years 1 months ago
A Reference Model for Seamless Cross-Organizational Collaboration in the Public Sector
: Today, electronic cross-company collaboration is about to gain significant momentum, but still shows weaknesses with respect to productivity, flexibility and quality: A lack of s...
Christoph Schroth
ENTCS
2008
170views more  ENTCS 2008»
14 years 11 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
JFP
2008
135views more  JFP 2008»
14 years 11 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
POPL
2009
ACM
16 years 11 days ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...