Sciweavers

1205 search results - page 11 / 241
» Program Extraction from Large Proof Developments
Sort
View
IADIS
2004
14 years 8 days ago
New Perspectives on Teaching and Learning Software Systems Development in Large Groups - Telecollaboration
This paper outlines new perspectives on the teaching and learning of software systems development in large groups based on a newly designed, final year, Software Systems Analysis ...
Zenon Chaczko, David J. Davis, Craig Scott
CADE
2008
Springer
14 years 11 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
14 years 11 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
ENTCS
2002
90views more  ENTCS 2002»
13 years 10 months ago
Refactoring in maintenance and development of Z specifications
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
Susan Stepney, Fiona Polack, Ian Toyn
VSTTE
2005
Springer
14 years 4 months ago
It Is Time to Mechanize Programming Language Metatheory
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...