#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2008

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioana Pasca
- TPHOLs
- 2008

In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly used reasoning steps on these constructs. We show that these iterated operations can be handled generically using the syntactic notation and canonical structure facilities provided by… (More)

- Georges Gonthier, Andrea Asperti, +12 authors Laurent Théry
- ITP
- 2013

This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by Coq. To support the formalization, we developed a… (More)

- Jan Olaf Blech, Sidi Ould Biha
- ArXiv
- 2013

Programmable Logic Controllers (PLC) and its programming standard IEC 61131-3 are widely used in embedded systems for the industrial automation domain. We propose a framework for the formal treatment of PLC based on the IEC 61131-3 standard. A PLC system description typically combines code written in different languages that are defined in IEC 61131-3. For… (More)

- Jan Olaf Blech, Sidi Ould Biha
- SEFM
- 2011

- Sidi Ould Biha
- 2011 IEEE 35th Annual Computer Software and…
- 2011

Programmable logic Controllers (PLC) are embedded systems that are widely used in industry. We propose a formal semantics of the Instruction List (IL) language, one of the five programing languages defined in the IEC 61131-3 standard for PLC programing. This semantics support a significant subset of the IL language that includes on-delay timers. We… (More)

- Sidi Ould Biha
- 2010

- Sidi Ould Biha
- Calculemus/MKM
- 2009

Representation theory is a branch of algebra that allows the study of groups through linear applications, i.e. matrices. Thus problems in abstract groups can be reduced to problems on matrices. Representation theory is the basis of character theory. In this paper we present a formalization of finite groups representation theory in the Coq system that… (More)

- ‹
- 1
- ›