Sciweavers

844 search results - page 81 / 169
» Safraless Decision Procedures
Sort
View
FOSSACS
2007
Springer
14 years 3 months ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
LICS
2005
IEEE
14 years 2 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
LPAR
2005
Springer
14 years 2 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
TYPES
2004
Springer
14 years 2 months ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
SEW
2003
IEEE
14 years 2 months ago
Model-Based Software Testing via Incremental Treatment Learning
Model-based software has become quite popular in recent years, making its way into a broad range of areas, including the aerospace industry. The models provide an easy graphical i...
Dustin Geletko, Tim Menzies