Sciweavers

199 search results - page 34 / 40
» A Fully Abstract Model for Graph-Interpreted Temporal Logic
Sort
View
CODES
2007
IEEE
15 years 3 months ago
Synchronization after design refinements with sensitive delay elements
The synchronous computational model with its simple computation and communication mechanism makes it easy to describe, simulate and formally verify synchronous embedded systems at...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
BPM
2006
Springer
149views Business» more  BPM 2006»
15 years 1 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...
SEKE
2010
Springer
14 years 9 months ago
Specification patterns can be formal and still easy
Abstract--Property specification is still one of the most challenging tasks for transference of software verification technology like model checking. The use of patterns has been p...
Fernando Asteasuain, Víctor A. Braberman
ESOP
2008
Springer
15 years 1 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
VMCAI
2009
Springer
15 years 6 months ago
Mixed Transition Systems Revisited
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
Ou Wei, Arie Gurfinkel, Marsha Chechik