( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learning to Prune Infeasible Paths in Generalized Symbolic Execution.

, , , и . ISSRE, стр. 494-504. IEEE, (2022)

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.

Marcelo Trallero

Marcelo Ephraim

Marcelo Giovannetti

Marcelo Klötzle

Marcelo Backes

 

Другие публикации лиц с тем же именем

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