Sciweavers

2881 search results - page 135 / 577
» Model Checking for Programming Languages using Verisoft
Sort
View
ICALP
2009
Springer
16 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VL
2007
IEEE
112views Visual Languages» more  VL 2007»
15 years 11 months ago
Visual Languages: A Matter of Style
This articles submits the thesis that visual data modeling and programming languages are conveniently conceived as rendering, or ‘styling’, of conventional, textual languages....
Sacha Berger, François Bry, Tim Furche, Chr...
SAS
2007
Springer
15 years 11 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
EMSOFT
2001
Springer
15 years 9 months ago
System-Level Types for Component-Based Design
Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, such as the communicat...
Edward A. Lee, Yuhong Xiong
ICFP
2003
ACM
16 years 5 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...