Sciweavers

3713 search results - page 293 / 743
» Constructing a Calculus of Programs
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 6 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
JLP
2006
81views more  JLP 2006»
15 years 6 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter

Book
273views
17 years 4 months ago
Designing and Building Parallel Program
"Designing and Building Parallel Programs is a book for students and professionals who need to know how to write parallel programs. It is neither a programming language manual...
Ian Foster
ICFP
2006
ACM
16 years 6 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
16 years 1 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper