Sciweavers

597 search results - page 56 / 120
» Formal Techniques for Java-Like Programs
Sort
View
EICS
2010
ACM
14 years 11 hour ago
User interface model discovery: towards a generic approach
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
Andy Gimblett, Harold W. Thimbleby
TOOLS
1999
IEEE
13 years 12 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
13 years 11 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
ICDCSW
2000
IEEE
13 years 11 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
IFL
2005
Springer
107views Formal Methods» more  IFL 2005»
14 years 1 months ago
With-Loop Fusion for Data Locality and Parallelism
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
Clemens Grelck, Karsten Hinckfuß, Sven-Bodo ...