Sciweavers

1194 search results - page 219 / 239
» A Calculus for Predicative Programming
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
15 years 2 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
213
Voted
POPL
2005
ACM
16 years 2 months ago
Synthesis of interface specifications for Java classes
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
P. Madhusudan, Pavol Cerný, Rajeev Alur, Wo...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 2 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
KBSE
2005
IEEE
15 years 8 months ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...
EACL
1993
ACL Anthology
15 years 3 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace