Sciweavers

1020 search results - page 114 / 204
» Tight Semantics for Logic Programs
Sort
View
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
15 years 1 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
PADO
2001
Springer
15 years 4 months ago
Run-Time Bytecode Specialization
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...
Hidehiko Masuhara, Akinori Yonezawa
CARDIS
2000
Springer
173views Hardware» more  CARDIS 2000»
15 years 4 months ago
Smart Tools for Java Cards
This article describes a Java Card programming environment which to a large extent is generated from formal specifications of the syntax and semantics of Java Card, the JCRE (Jav...
Isabelle Attali, Denis Caromel, Carine Courbis, Lu...
ECOOP
2006
Springer
15 years 3 months ago
Improving AOP Systems' Evolvability by Decoupling Advices from Base Code
The evolvability of AOP systems is severely affected by the tight coupling between aspects and base code. This paper identifies the advice fragility problem, originated in the need...
Alan Cyment, Nicolas Kicillof, Rubén Altman...
KI
2007
Springer
15 years 6 months ago
Proposal of Generalized Rule Programming Model
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
Grzegorz J. Nalepa, Igor Wojnicki