Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/151840
-
Title: 
Under-approximating loops in C programs for fast counterexample detection
-
Citation: 
Lewis, M., Kroening, D., & Weissenbacher, G. (2015). Under-approximating loops in C programs for fast counterexample detection. Formal Methods in System Design, 47(1), 75–92. https://doi.org/10.1007/s10703-015-0228-1
-
Publisher DOI: 
10.1007/s10703-015-0228-1
-
Publication Type: 
Artikel - Original Research Article
de
 
Article - Original Research Article
en
Authors: 
Lewis, Matt 
Kroening, Daniel 
Weissenbacher, Georg 
-
Organisational Unit: 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
-
Journal: 
Formal Methods in System Design 
-
ISSN: 
0925-9856
-
Date (published): 
2015
-
Number of Pages: 
18
-
Peer reviewed: 
No
-
Keywords: 
Software; Theoretical Computer Science; Hardware and Architecture
-
Project title: 
Heisenbugs: Auffindung und Erklärung 
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Article

Show full item record

Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.

Page view(s)

8
checked on Mar 2, 2023

Google ScholarTM

Check