Sciweavers

3775 search results - page 450 / 755
» The Expression Problem Revisited
Sort
View
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
The theory and calculus of aliasing
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obje...
Bertrand Meyer
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
ECEASST
2008
171views more  ECEASST 2008»
15 years 6 months ago
Type Checking C++ Template Instantiation by Graph Programs
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
Karl Azab, Karl-Heinz Pennemann
194
Voted
IANDC
2008
87views more  IANDC 2008»
15 years 6 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 6 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu