Sciweavers

TOCL
2008
128views more  TOCL 2008»
13 years 4 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
IIE
2008
97views more  IIE 2008»
13 years 4 months ago
Mathematical Logic and Deduction in Computer Science Education
Mathematical logic is a discipline used in sciences and humanities with different point of view. Although in tertiary level computer science education it has a solid place, it does...
Hashim Habiballa, Tibor Kmet
AO
2007
80views more  AO 2007»
13 years 4 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner

0
posts
with
0
views
93profile views
plmdayStudent, Msc
plmday

0
posts
with
0
views
194profile views
Carlos Martínez MéndezProfessor, Assistant
Universidad Central de Chile
Carlos Martínez Méndez
Appointed since Spring 2007 as Academic Coordinator in Escuela de Ingeniería en Computación, Universidad Central de Chile, Santiago, Chile. Lecturer in Computer Science Departmen...
ATAL
2006
Springer
13 years 6 months ago
Logics of propositional control
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
Jelle Gerbrandy
PPDP
2005
Springer
13 years 9 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...