Sciweavers

272 search results - page 8 / 55
» Programming languages capturing complexity classes
Sort
View
ICALP
2000
Springer
13 years 11 months ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
PLDI
2000
ACM
13 years 11 months ago
Type-based race detection for Java
This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchr...
Cormac Flanagan, Stephen N. Freund
PODS
1991
ACM
93views Database» more  PODS 1991»
13 years 11 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
IDEAL
2005
Springer
14 years 27 days ago
Patterns in Complex Systems Modeling
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...
Janet Wiles, James Watson
GPCE
2008
Springer
13 years 8 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...