Sciweavers

58 search results - page 8 / 12
» Call Graph Construction in Object-Oriented Languages
Sort
View
103
Voted
ENTCS
2006
109views more  ENTCS 2006»
15 years 11 days ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
119
Voted
CONCUR
2006
Springer
15 years 4 months ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
114
Voted
PLDI
1995
ACM
15 years 3 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 14 days ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CONCUR
2006
Springer
15 years 2 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson