Français
Relational tight field bounds for distributed analysis of programs
Multi angle
Authors : Frias, Marcelo (Author of the conference)
CIRM (Publisher )
68Q10 - Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60 - Specification and verification (program logics, model checking, etc.)
68W40 - Analysis of algorithms
Additional resources :
https://www.cirm-math.fr/RepOrga/2398/Slides/Frias.pdf
CIRM (Publisher )
Loading the player...
|
Abstract :
Relational tight field bounds are an abstraction of the semantics of data structures. In the presence of appropriate symmetry-breaking predicates, these bounds can be computed automatically and allow to dramatically speed up bug-finding using SAT- solving. In this lecture, after giving an introduction to tight field bounds and symmetry- breaking predicates, I will present a general technique for distributing program analyses. As examples, I will show how the technique allows one to distribute SAT-based bug-finding as well as symbolic execution over complex data types.
Keywords : Distributed bug finding; distributed symbolic execution; distributed program analysis
MSC Codes : Keywords : Distributed bug finding; distributed symbolic execution; distributed program analysis
68Q10 - Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60 - Specification and verification (program logics, model checking, etc.)
68W40 - Analysis of algorithms
Additional resources :
https://www.cirm-math.fr/RepOrga/2398/Slides/Frias.pdf
|
Information on the Video
Film maker : Recanzone, LucaLanguage : English Available date : 26/11/2021 Conference Date : 03/11/2021 Subseries : Research talks arXiv category : Computer Science Mathematical Area(s) : Computer Science Format : MP4 (.mp4) - HD Video Time : 01:03:09 Targeted Audience : Researchers Download : https://videos.cirm-math.fr/2021-11-3_Frias.mp4 
|
Information on the Event
Event Title : 19th International Conference on Relational and Algebraic Methods in Computer Science / 19ème Conférence internationale de méthodes relationnelles et algébriques en informatiqueEvent Organizers : Fahrenberg, Uli ; Gehrke, Mai ; Santocanale, Luigi ; Winter, Michael Dates : 02/11/2021 - 06/11/2021 Event Year : 2021 Event URL : https://conferences.cirm-math.fr/2398.html
Citation Data
DOI : 10.24350/CIRM.V.19827503Cite this video as: Frias, Marcelo (2021). Relational tight field bounds for distributed analysis of programs. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19827503 URI : http://dx.doi.org/10.24350/CIRM.V.19827503 |
See Also
- [Multi angle] Quantified constraint satisfaction problem: towards the classification of complexity / Author of the conference Zhuk, Dmitriy.
- [Multi angle] Relational models for the Lambek calculus with intersection and unit / Author of the conference Kuznetsov, Stepan.
- [Multi angle] Time warps, from algebra to algorithms / Author of the conference Santschi, Simon.
- [Multi angle] Fixpoint games / Author of the conference König, Barbara.
Bibliography
- GALEOTTI, Juan P., ROSNER, Nicolás, POMBO, Carlos G. López, et al. TACO: Efficient SAT-based bounded verification using symmetry breaking and tight bounds. IEEE Transactions on Software Engineering, 2013, vol. 39, no 9, p. 1283-1307. - https://doi.org/10.1109/TSE.2013.15
- ROSNER, Nicolás, GALEOTTI, Juan, BERMÚDEZ, Santiago, et al. Parallel bounded analysis in code with rich invariants by refinement of field bounds. In : Proceedings of the 2013 International Symposium on Software Testing and Analysis. 2013. p. 23-33. - https://doi.org/10.1145/2483760.2483770
