Sciweavers

2604 search results - page 23 / 521
» General constant expressions for system programming language...
Sort
View
POPL
2010
ACM
14 years 4 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
KBSE
2010
IEEE
13 years 6 months ago
An automated approach for finding variable-constant pairing bugs
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
Julia L. Lawall, David Lo
ENTCS
2008
175views more  ENTCS 2008»
13 years 7 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
SCP
1998
138views more  SCP 1998»
13 years 7 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara