Sciweavers

444 search results - page 69 / 89
» Automated Logical Verification Based on Trace Abstractions
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
LICS
2006
IEEE
14 years 1 months ago
Saturated Semantics for Reactive Systems
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Filippo Bonchi, Barbara König, Ugo Montanari
BPM
2006
Springer
149views Business» more  BPM 2006»
13 years 9 months ago
Verifying BPEL Workflows Under Authorisation Constraints
Abstract. Business Process Execution Language (BPEL), or Web Services BPEL (WS-BPEL), is the standard for specifying workflow process definition using web services. Research on for...
Zhao Xiangpeng, Antonio Cerone, Padmanabhan Krishn...
CSL
2006
Springer
13 years 11 months ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski
LPAR
1999
Springer
13 years 12 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies