Sciweavers

4281 search results - page 30 / 857
» How to Disembed a Program
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
FORTE
2008
13 years 9 months ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng
SAMOS
2010
Springer
13 years 6 months ago
Identifying communication models in Process Networks derived from Weakly Dynamic Programs
—Process Networks (PNs) is an appealing computation ion helping to specify an application in parallel form and realize it on parallel platforms. The key questions to be answered ...
Dmitry Nadezhkin, Todor Stefanov
JAVA
1999
Springer
13 years 11 months ago
Dynamic Denotational Semantics of Java
This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full range of the base language, excluding only concurrenc...
Jim Alves-Foss, Fong Shing Lam
ECOOP
1993
Springer
13 years 11 months ago
Integrating Independently-Developed Components in Object-Oriented Languages
Object-oriented programming promises to increase programmer productivity through better reuse of existing code. However, reuse is not yet pervasive in today’s object-oriented pro...
Urs Hölzle