Sciweavers

227 search results - page 41 / 46
» Tutorial: Parallel Model Checking
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
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
MIDDLEWARE
2004
Springer
14 years 27 days ago
Developing and Managing Software Components in an Ontology-Based Application Server
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...
Daniel Oberle, Andreas Eberhart, Steffen Staab, Ra...
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
FOSSACS
2010
Springer
14 years 2 months ago
Retaining the Probabilities in Probabilistic Testing Theory
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
Sonja Georgievska, Suzana Andova