Sciweavers

168 search results - page 24 / 34
» On Models for Quantified Boolean Formulas
Sort
View
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 25 days ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
DAC
2002
ACM
14 years 8 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
FORTE
2004
13 years 9 months ago
PEPA Nets in Practice: Modelling a Decentralised Peer-to-Peer Emergency Medical Application
Abstract. We apply the PEPA nets modelling language to modelling a peer-topeer medical informatics application, the FieldCare PDA-based medical records system developed by SINTEF T...
Stephen Gilmore, Valentin Haenel, Jane Hillston, L...