2777 search results - page 204 / 556 » Example centric programming |
86
Voted
TSE
2008
15 years 22 days ago
2008
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
108
Voted
EATCS
2000
15 years 19 days ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
99
Voted
JOT
2010
14 years 11 months ago
2010
ional Abstraction Steps Lone Leth Thomsena Bent Thomsena Kurt Nørmarka a. Department of Computer Science, Aalborg University, Denmark In this paper we discuss computational abstra...
180
Voted
IJAC
2011
14 years 7 months ago
2011
— To successfully design and engineer solutions for today’s and tomorrow’s rapidly changing and expanding global contexts, in which people are confronted with new opportuniti...
145
click to vote
NFM
2011
14 years 7 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...