Sciweavers

88 search results - page 6 / 18
» Matching Systems for Concurrent Calculi
Sort
View
ICTCS
2007
Springer
15 years 3 months ago
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
Marco Bernardo, Alessandro Aldini
LICS
2009
IEEE
15 years 4 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
ESOP
2007
Springer
15 years 3 months ago
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
Abstract. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Serv...
Maria Grazia Buscemi, Ugo Montanari
ICFP
2004
ACM
15 years 9 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
68
Voted
EURODAC
1990
IEEE
74views VHDL» more  EURODAC 1990»
15 years 1 months ago
Matching system and component behaviour in MIMOLA synthesis tools
This paper discusses the selection of available components during high-level synthesis. We stress the importance of describing the behaviour of available components in some langua...
Peter Marwedel