Sciweavers

179 search results - page 28 / 36
» Compositional semantics and behavioral equivalences for P Sy...
Sort
View
ESOP
2008
Springer
13 years 9 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
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
14 years 1 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....
VLDB
2004
ACM
128views Database» more  VLDB 2004»
14 years 1 months ago
An Annotation Management System for Relational Databases
We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with ...
Deepavali Bhagwat, Laura Chiticariu, Wang Chiew Ta...
CC
2001
Springer
131views System Software» more  CC 2001»
14 years 4 days ago
Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
Abstract. Efficient implementation of DSP applications are critical for embedded systems. However, current applications written in C, make extensive use of pointer arithmetic maki...
Björn Franke, Michael F. P. O'Boyle
CONCUR
2009
Springer
14 years 2 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...