Sciweavers

147 search results - page 28 / 30
» Reasoning about Deadlines in Concurrent Real-Time Programs
Sort
View
KBSE
2003
IEEE
14 years 22 days ago
Model-based Verification of Web Service Compositions
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Howard Foster, Sebastián Uchitel, Jeff Mage...
JLP
2008
121views more  JLP 2008»
13 years 6 months ago
A process algebraic view of shared dataspace coordination
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
Nadia Busi, Gianluigi Zavattaro
TCAD
2010
121views more  TCAD 2010»
13 years 2 months ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
DFT
2006
IEEE
130views VLSI» more  DFT 2006»
14 years 1 months ago
Off-Chip Control Flow Checking of On-Chip Processor-Cache Instruction Stream
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...
Federico Rota, Shantanu Dutt, Sahithi Krishna
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon