Author of the publication

Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds.

, , , , , and . FASE, volume 12649 of Lecture Notes in Computer Science, page 218-239. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A strategy for efficient verification of relational specifications, based on monotonicity analysis., , , and . ASE, page 305-308. ACM, (2005)A calculus for program construction based on fork algebras, generic algorithms and design strategies., , and . RelMiCS, page 75-79. (1998)A Dataflow Analysis to Improve SAT-Based Bounded Program Verification., , , and . SEFM, volume 7041 of Lecture Notes in Computer Science, page 138-154. Springer, (2011)Inference engine based on closure and join operators over Truth Table Binary Relations., , , , , and . J. Log. Algebraic Methods Program., 83 (2): 180-193 (2014)Completeness of a relational calculus for program schemes., and . Theor. Comput. Sci., 254 (1-2): 543-556 (2001)Editorial., and . Logic Journal of the IGPL, 6 (2): 151-156 (1998)Bounded Exhaustive Search of Alloy Specification Repairs., , , , , , and . ICSE, page 1135-1147. IEEE, (2021)EvoSpex: An Evolutionary Algorithm for Learning Postconditions (artifact)., , , and . ICSE (Companion Volume), page 185-186. IEEE, (2021)LISSA: Lazy Initialization with Specialized Solver Aid., , , , and . ASE, page 67:1-67:12. ACM, (2022)Fork Algebras in Algebra, Logic and Computer Science., , and . Fundam. Informaticae, 32 (1): 1-25 (1997)