Corneliu Popeea

29 papers A* 6A 4B 3C 3Misc 3Journal 4Unranked 6
YearRankTypeTitle / Venue / Authors
2016 — conf
Efficient CTL Verification via Horn Constraints Solving.
HCVS@ETAPS
Tewodros A. Beyene, Corneliu Popeea, Andrey Rybalchenko
2015 — conf
Recursive Games for Compositional Program Synthesis.
VSTTE
Tewodros A. Beyene, Swarat Chaudhuri, Corneliu Popeea, Andrey Rybalchenko
2014 A* conf
A constraint-based approach to solving games on infinite graphs.
POPL
Tewodros A. Beyene, Swarat Chaudhuri, Corneliu Popeea, Andrey Rybalchenko
2014 — conf
Generalised Interpolation by Solving Recursion-Free Horn Clauses
HCVS
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2014 B conf
Reduction for compositional verification of multi-threaded programs.
FMCAD
Corneliu Popeea, Andrey Rybalchenko, Andreas Wilhelm
2013 J jnl
Dual analysis for proving safety and finding bugs.
Sci. Comput. Program.
Corneliu Popeea, Wei-Ngan Chin
2013 A* conf
Solving Existentially Quantified Horn Clauses.
CAV
Tewodros A. Beyene, Corneliu Popeea, Andrey Rybalchenko
2013 A conf
Threader: A Verifier for Multi-threaded Programs - (Competition Contribution).
TACAS
Corneliu Popeea, Andrey Rybalchenko
2012 A conf
Compositional Termination Proofs for Multi-threaded Programs.
TACAS
Corneliu Popeea, Andrey Rybalchenko
2012 A conf
HSF(C): A Software Verifier Based on Horn Clauses - (Competition Contribution).
TACAS
Sergey Grebenshchikov, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, Andrey Rybalchenko
2012 A* conf
Synthesizing software verifiers from proof rules.
PLDI
Sergey Grebenshchikov, Nuno P. Lopes, Corneliu Popeea, Andrey Rybalchenko
2011 A* conf
Predicate abstraction and refinement for verifying multi-threaded programs.
POPL
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2011 B conf
Solving Recursion-Free Horn Clauses over LI+UIF.
APLAS
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2011 A* conf
Threader: A Constraint-Based Verifier for Multi-threaded Programs.
CAV
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2010 Misc conf
Dual analysis for proving safety and finding bugs.
SAC
Corneliu Popeea, Wei-Ngan Chin
2010 B conf
Non-monotonic Refinement of Control Abstraction for Concurrent Programs.
ATVA
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2008 C conf
A practical and precise inference and specializer for array bound checks elimination.
PEPM
Corneliu Popeea, Dana N. Xu, Wei-Ngan Chin
2008 C conf
Analysing memory resource bounds for low-level programs.
ISMM
Wei-Ngan Chin, Huu Hai Nguyen, Corneliu Popeea, Shengchao Qin
2006 A conf
A flow-based approach for variant parametric types.
OOPSLA
Wei-Ngan Chin, Florin Craciun, Siau-Cheng Khoo, Corneliu Popeea
2006 — conf
Core-java: an expression-oriented java.
OOPSLA Companion
Florin Craciun, Hong Yaw Goh, Corneliu Popeea, Wei-Ngan Chin
2006 — conf
Inferring Disjunctive Postconditions.
ASIAN
Corneliu Popeea, Wei-Ngan Chin
2005 A* conf
Verifying safety policies with size properties and alias controls.
ICSE
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Corneliu Popeea, Huu Hai Nguyen
2004 C conf
A type system for resource protocol verification and its correctness proof.
PEPM
Corneliu Popeea, Wei-Ngan Chin
2003 J jnl
Efficient state-space approach for FIR filter bank completion.
Signal Process.
Corneliu Popeea, Bogdan Dumitrescu, Boris Jora
2002 J jnl
Accurate computation of compaction filters with high regularity.
IEEE Signal Process. Lett.
Bogdan Dumitrescu, Corneliu Popeea
2001 Misc conf
An efficient algorithm for FIR filter bank completion.
ICASSP
Corneliu Popeea, Bogdan Dumitrescu, Boris Jora
2001 J jnl
Optimal compaction gain by eigenvalue minimization.
Signal Process.
Corneliu Popeea, Bogdan Dumitrescu
2000 Misc conf
A low complexity SDP method for designing optimum compaction filters.
ICASSP
Bogdan Dumitrescu, Corneliu Popeea
1999 — conf
Optimizing the compaction gain in a class of IIR filters.
ISCAS (3)
Ioan Tabus, Corneliu Popeea, Jaakko Astola