Computation history

In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2017
012319872017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this work, we incorporate reversibility into structured communication-<lb>based programming, to allow parties of a session to… (More)
  • figure 1
  • figure 4
  • figure 7
Is this relevant?
2014
2014
VerSum allows lightweight clients to outsource expensive computations over large and frequently changing data structures, such as… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 8
  • figure 12
Is this relevant?
2014
2014
VERSUM allows lightweight clients to outsource expensive computations over large and frequently changing data structures, such as… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 8
  • figure 12
Is this relevant?
2014
2014
In this work, we incorporate reversibility into structured communication-based programming, to allow parties of a session to… (More)
Is this relevant?
2011
2011
The Saturation-style fixpoint iteration strategy for symbolic reachability analysis is particularly effective for globally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
All Pairs Similarity Search (APSS) is a ubiquitous problem in many data mining applications and involves finding all pairs of… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
A reversible programming language supports deterministic forward and backward computation. We formalize the programming language… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2007
2007
The challenge of finding compositional ways of (formally) developing concurrent programs is considerable. Various forms of rely… (More)
  • figure 1
  • figure 3
Is this relevant?
1993
1993
We present the implementation of a Prolog system composed of interpreter and compiler. The originality of our work consists in… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In our model, a graph describes a net of processes communicating through ports and, at the same time, its computation history… (More)
  • figure I
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?