Sciweavers

8132 search results - page 276 / 1627
» Dependability, Abstraction, and Programming
Sort
View
JAVA
1999
Springer
15 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
AMAI
2006
Springer
15 years 6 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
SEFM
2009
IEEE
16 years 1 months ago
A Computability Perspective on Self-Modifying Programs
Abstract—In order to increase their stealth, malware commonly use the self-modification property of programs. By doing so, programs can hide their real code so that it is diffi...
Guillaume Bonfante, Jean-Yves Marion, Daniel Reyna...
CAI
2009
Springer
16 years 1 months ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump
EUROGP
2004
Springer
135views Optimization» more  EUROGP 2004»
16 years 2 days ago
Reusing Code in Genetic Programming
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
Edgar Galván López, Riccardo Poli, C...