Julien Schmaltz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Julien Schmaltz has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dominique Borrione
TIMA Laboratory
2 shared publications - Freek Verbeek
Open University of the Netherlands
2 shared publications - Diana Toma
TIMA Laboratory
1 shared publication - Ghiath Al Sammane
TIMA Laboratory
1 shared publication Pierre Ostier
TIMA Laboratory
1 shared publication
Latest Publications
- Open Access
- 26 April 2013
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 114, 70-84
Verification of Building Blocks for Asynchronous Circuits
Scalable formal verification constitutes an important challenge for the design of asynchronous circuits. Deadlock freedom is a property that is desired but hard to verify. It is an emergent property that has to be verified monolithically. We present our approach to using ACL2 to verify necessary and sufficient conditions over asynchronous delay-insensitive primitives. These conditions are used to derive SAT/SMT instances from circuits built out of these primitives. These SAT/SMT instances help in establishing absence of deadlocks. Our verification effort consists of building an executable checker in the ACL2 logic tailored for our purpose. We prove that this checker is correct. This approach enables us to prove ACL2 theorems involving defun-sk constructs and free variables fully automatically.Comment: In Proceedings ACL2 2013, arXiv:1304.712
- 26 April 2013
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 114, 70-84
Open AccessVerification of Building Blocks for Asynchronous Circuits
Scalable formal verification constitutes an important challenge for the design of asynchronous circuits. Deadlock freedom is a property that is desired but hard to verify. It is an emergent property that has to be verified monolithically. We present our approach to using ACL2 to verify necessary and sufficient conditions over asynchronous delay-insensitive primitives. These conditions are used to derive SAT/SMT instances from circuits built out of these primitives. These SAT/SMT instances help in establishing absence of deadlocks. Our verification effort consists of building an executable checker in the ACL2 logic tailored for our purpose. We prove that this checker is correct. This approach enables us to prove ACL2 theorems involving defun-sk constructs and free variables fully automatically.Comment: In Proceedings ACL2 2013, arXiv:1304.712
- 18 September 2010
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 48 (4) , 419-439
Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
- 18 September 2010
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 48 (4) , 419-439
Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
- Open Access
- 1 May 2008
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 20 (3) , 241-258
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication architectures at a high level of abstraction. This model is described mathematically by a function, named GeNoC . The correctness of GeNoC is expressed as a theorem, which states that messages emitted on the architecture reach their expected destination without any modification of their content. The model identifies the key constituents common to all on chip communication architectures, and their essential properties from which the correctness theorem is deduced. Each constituent is represented by a function that has no explicit definition but is constrained to satisfy the essential properties. Thus, the validation of a particular architecture is reduced to the proof that its concrete definition satisfies the essential properties. In practice, the model has been defined in the logic of the ACL2 theorem proving system. We illustrate our approach on several architectures that constitute concrete instances of the generic GeNoC model. Some of these applications come from industrial designs, such as the AMBA AHB bus or the Octagon network from ST Microelectronics.
- 1 May 2008
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 20 (3) , 241-258
Open AccessA functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication architectures at a high level of abstraction. This model is described mathematically by a function, named GeNoC . The correctness of GeNoC is expressed as a theorem, which states that messages emitted on the architecture reach their expected destination without any modification of their content. The model identifies the key constituents common to all on chip communication architectures, and their essential properties from which the correctness theorem is deduced. Each constituent is represented by a function that has no explicit definition but is constrained to satisfy the essential properties. Thus, the validation of a particular architecture is reduced to the proof that its concrete definition satisfies the essential properties. In practice, the model has been defined in the logic of the ACL2 theorem proving system. We illustrate our approach on several architectures that constitute concrete instances of the generic GeNoC model. Some of these applications come from industrial designs, such as the AMBA AHB bus or the Octagon network from ST Microelectronics.
- 1 January 2003
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-157
Constrained Symbolic Simulation with Mathematica and ACL2
- 1 January 2003
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-157
Constrained Symbolic Simulation with Mathematica and ACL2