Sciweavers

71 search results - page 7 / 15
» Using Datalog with Binary Decision Diagrams for Program Anal...
Sort
View
ICDE
2010
IEEE
192views Database» more  ICDE 2010»
14 years 1 months ago
XML reasoning made practical
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
Pierre Genevès, Nabil Layaïda
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 6 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
VMCAI
2005
Springer
14 years 5 days ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
Samir Genaim, Fausto Spoto
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
13 years 10 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
ISSTA
1998
ACM
13 years 10 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...