Sciweavers

1606 search results - page 95 / 322
» XML-based programming language modeling: An approach to soft...
Sort
View
PEPM
1993
ACM
15 years 10 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
VMCAI
2004
Springer
15 years 11 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
EMSOFT
2006
Springer
15 years 9 months ago
A timing model for synchronous language implementations in simulink
We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementat...
Timothy Bourke, Arcot Sowmya
ISSTA
2012
ACM
13 years 8 months ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...
TAPSOFT
1997
Springer
15 years 10 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko