Sciweavers

1715 search results - page 217 / 343
» Domain-Specific Program Checking
Sort
View
QEST
2006
IEEE
14 years 4 months ago
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
Frank Ciesinski, Christel Baier
FSTTCS
2004
Springer
14 years 3 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 3 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
SAT
2004
Springer
85views Hardware» more  SAT 2004»
14 years 3 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
COCOON
2003
Springer
14 years 3 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu