Sciweavers

621 search results - page 68 / 125
» Functional and structural properties in the Model-Driven Eng...
Sort
View
ICFP
2009
ACM
15 years 10 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
TOPLAS
2002
98views more  TOPLAS 2002»
14 years 9 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson
ICCAD
2008
IEEE
130views Hardware» more  ICCAD 2008»
15 years 6 months ago
Lightweight secure PUFs
— To ensure security and robustness of the next generation of Physically Unclonable Functions (PUFs), we have developed a new methodology for PUF design. Our approach employs int...
Mehrdad Majzoobi, Farinaz Koushanfar, Miodrag Potk...
69
Voted
ICFEM
2010
Springer
14 years 8 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...
CODES
2008
IEEE
14 years 11 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner