Sciweavers

6554 search results - page 325 / 1311
» Constraint Logic Programming
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
BIRTHDAY
2010
Springer
15 years 7 months ago
Counterexample Guided Path Reduction for Static Program Analysis
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
Ansgar Fehnker, Ralf Huuck, Sean Seefried
CADE
1992
Springer
15 years 10 months ago
Implementing the Meta-Theory of Deductive Systems
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
Frank Pfenning, Ekkehard Rohwedder
VSTTE
2010
Springer
15 years 5 months ago
Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
Stan Rosenberg, Anindya Banerjee, David A. Naumann
LCC
1994
213views Algorithms» more  LCC 1994»
15 years 10 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...