Sciweavers

2584 search results - page 211 / 517
» On the Forward Checking Algorithm
Sort
View
ECOOP
2008
Springer
15 years 4 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
AAAI
2004
15 years 3 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
FMSD
2006
103views more  FMSD 2006»
15 years 2 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
109
Voted
ENTCS
2007
144views more  ENTCS 2007»
15 years 2 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
GI
2009
Springer
15 years 3 days ago
A Static Analysis Technique to Detect Unsatisfiable Conditions in Ontology-based Workflows
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...
Gabriele Weiler, Arnd Poetzsch-Heffter, Stephan Ki...