Sciweavers

286 search results - page 49 / 58
» Reasoning About Partial Functions in the Formal Development ...
Sort
View
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 8 months ago
Integrating Defeasible Argumentation and Machine Learning Techniques
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
Sergio Alejandro Gómez, Carlos Iván ...
CAV
2012
Springer
265views Hardware» more  CAV 2012»
11 years 10 months ago
An Axiomatic Memory Model for POWER Multiprocessors
The growing complexity of hardware optimizations employed by multiprocessors leads to subtle distinctions among allowed and disallowed behaviors, posing challenges in specifying th...
Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayv...
ISARCS
2010
240views Hardware» more  ISARCS 2010»
13 years 10 months ago
Engineering a Distributed e-Voting System Architecture: Meeting Critical Requirements
Voting is a critical component of any democratic process; and electronic voting systems should be developed following best practices for critical system development. E-voting has i...
J. Paul Gibson, Eric Lallet, Jean-Luc Raffy
POPL
1989
ACM
14 years 13 days ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
PEPM
2010
ACM
13 years 10 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...