Even if the application developers produce software in accordance with the customer requirements, they cannot guarantee that the software will behave in a safe way during the lifet...
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
A key phenomenon in the dynamics of genetic networks is the cell cycle. In the study of this phenomenon, an important task is to understand how many processes, acting on different...
Xilin Wei, Roderick V. N. Melnik, Gabriel Moreno-H...
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor, Kri...