Sciweavers

2873 search results - page 438 / 575
» Model Checking and the Mu-calculus
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
FM
2008
Springer
93views Formal Methods» more  FM 2008»
13 years 9 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
DLT
2008
13 years 9 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
LREC
2008
115views Education» more  LREC 2008»
13 years 9 months ago
Generating Bilingual Dictionaries by Transitivity
Recently the LATL has undertaken the development of a multilingual translation system based on a symbolic parsing technology and on a transfer-based translation model. A crucial c...
Luka Nerima, Eric Wehrli
MKWI
2008
151views Business» more  MKWI 2008»
13 years 9 months ago
Towards A Formal Framework for Business Process Compliance
: The advent of regulatory compliance requirements such as Sarbanes Oxley Act has forced enterprises to set up a process for managing an effective internal controls system on busin...
Kioumars Namiri, Nenad Stojanovic