Sciweavers

4257 search results - page 41 / 852
» The Logical Modularity of Programs
Sort
View
LOPSTR
2004
Springer
14 years 2 months ago
A Generic Framework for Context-Sensitive Analysis of Modular Programs
Abstract. Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in or...
Germán Puebla, Jesús Correas, Manuel...
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
13 years 10 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani
IWFM
1998
134views Formal Methods» more  IWFM 1998»
13 years 10 months ago
Facilitating Modular Property-Preserving Extensions of Programming Languages
We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on ...
Claus Pahl
APIN
1998
139views more  APIN 1998»
13 years 8 months ago
Evolutionary Learning of Modular Neural Networks with Genetic Programming
Evolutionary design of neural networks has shown a great potential as a powerful optimization tool. However, most evolutionary neural networks have not taken advantage of the fact ...
Sung-Bae Cho, Katsunori Shimohara
RTA
2011
Springer
12 years 12 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl