Sciweavers

61 search results - page 6 / 13
» Invariant Checking for Programs with Procedure Calls
Sort
View
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 7 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
FOSSACS
2008
Springer
13 years 9 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
ISSRE
2003
IEEE
14 years 19 days ago
Exploiting Symmetries to Test Programs
Symmetries often appear as properties of many artifical settings. In Program Testing, they can be viewed as properties of programs and can be given by the tester to check the cor...
Arnaud Gotlieb
KBSE
2006
IEEE
14 years 1 months ago
Accurate Centralization for Applying Model Checking on Networked Applications
Software model checkers can be applied directly to single-process programs, which typically are multithreaded. Multi-process applications cannot be model checked directly. While m...
Cyrille Artho, Pierre-Loïc Garoche
POPL
2006
ACM
14 years 7 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan