Sciweavers

499 search results - page 76 / 100
» LTL satisfiability checking
Sort
View
ESOP
2008
Springer
15 years 1 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
MKWI
2008
151views Business» more  MKWI 2008»
15 years 1 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
BDA
2006
15 years 1 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
FORTE
2001
15 years 1 months ago
Patterns and Rules for Behavioural Subtyping
Abstract Subtyping relations for object-oriented formalisms describe relationships between super- and subclasses which satisfy the substitutability requirement imposed on types and...
Heike Wehrheim
AAAI
1996
15 years 1 months ago
Trajectory Constraints in Qualitative Simulation
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
Giorgio Brajnik, Daniel J. Clancy