Pedro R. G. Antonino

Orcid: 0000-0002-5627-0910

According to our database1, Pedro R. G. Antonino authored at least 23 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A formal component model for UML based on CSP aiming at compositional verification.
Softw. Syst. Model., June, 2024

A refinement-based approach to safe smart contract deployment and evolution.
Softw. Syst. Model., June, 2024

Extracting Formal Smart-Contract Specifications from Natural Language with LLMs.
Proceedings of the Formal Aspects of Component Software - 20th International Conference, 2024

2023
Flexible Remote Attestation of Pre-SNP SEV VMs Using SGX Enclaves.
IEEE Access, 2023

The Consensus Machine: Formalising Consensus in the Presence of Malign Agents.
Proceedings of the Theories of Programming and Formal Methods, 2023

2022
Approximate verification of concurrent systems using token structures and invariants.
Int. J. Softw. Tools Technol. Transf., 2022

A Pattern-based deadlock-freedom analysis strategy for concurrent systems.
CoRR, 2022

Specification is Law: Safe Creation and Upgrade of Ethereum Smart Contracts.
Proceedings of the Software Engineering and Formal Methods - 20th International Conference, 2022

2021
Trusted And Confidential Program Analysis.
CoRR, 2021

Solidifier: bounded model checking solidity using lazy contract deployment and precise memory modelling.
Proceedings of the SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing, 2021

Guardian: Symbolic Validation of Orderliness in SGX Enclaves.
Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

2020
Formalising and verifying smart contracts with Solidifier: a bounded model checker for Solidity.
CoRR, 2020

2019
Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving.
ACM Trans. Softw. Eng. Methodol., 2019

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving.
Formal Aspects Comput., 2019

2018
Verifying concurrent systems by approximation.
PhD thesis, 2018

2017
The Automatic Detection of Token Structures and Invariants Using SAT Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Checking Static Properties Using Conservative SAT Approximations for Reachability.
Proceedings of the Formal Methods: Foundations and Applications - 20th Brazilian Symposium, 2017

2016
Rigorous development of component-based systems using component metadata and patterns.
Formal Aspects Comput., 2016

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Tighter Reachability Criteria for Deadlock-Freedom Analysis.
Proceedings of the FM 2016: Formal Methods, 2016

2014
Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification.
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes.
Proceedings of the FM 2014: Formal Methods, 2014

2013
Algebraic Laws for Process Subtyping.
Proceedings of the Formal Methods and Software Engineering, 2013


  Loading...