Software Engineer: Go & Kubernetes, Containers, Linux - Personal preference: Elixir (BEAM) - Before: Big Latin American systems: many constraints - Technology as a means of social progress whoami
interconnections of our systems - Solutions: Monitoring, Chaos Engineering, On-Call rotations, Testing in Production, etc. Formal Verification - Formal specification languages & model checkers - Still requires the definition of the program, possible failures, correctness definitions
objects. - Seven Bridges of Könisberg (1736, Euler) is the first paper in history of graph theory - K-connectedness: how many nodes we need to disconnect a graph (a system) - Verify points of failure
with discretized spaces - Allows to have all the (system) perspectives (of a node) available at the same time - Perspectives evolve with communication - Perspective = the view from a single node
way they represent spaces and in the continuous transformations that preserve properties. - Spaces made up of simple pieces for which essential properties can be characterized by counting, such as the sum of the degrees of the nodes in a graph. - Countable items allow combinations (interactions)
as (a set of) topological entities that are subject to (valid) subdivisions, analysis of the persistence and consistency of their interconnections (paths), offering a comprehensive set of states of the world
graph, it can also be described as a topological object (if the connections are preserved) Theorem: A topology on V is compatible with a graph G(V,E) if every induced subgraph of G is connected if and only if its vertex set is topologically connected (too).
connections and interactions (in terms of formal Connectivity) Get all the possible states of the world (use cases; paths) Once all the connections are topologically correct, we can say that the system is verified.
2. The Topology of shared-memory adversaries https://dl.acm.org/citation.cfm?doid=1835698.1835724 3. Distributed Computing Through Combinatorial Topology https://www.elsevier.com/books/distributed-computing-through-combinatorial-topolo gy/herlihy/978-0-12-404578-1
Software Engineer: Go & Kubernetes, Containers, Linux - Personal preference: Elixir (BEAM) - Before: Big Latin American systems: many constraints - Technology as a means of social progress whoami
interconnections of our systems - Solutions: Monitoring, Chaos Engineering, On-Call rotations, Testing in Production, etc. Formal Verification - Formal specification languages & model checkers - Still requires the definition of the program, possible failures, correctness definitions
objects. - Seven Bridges of Könisberg (1736, Euler) is the first paper in history of graph theory - K-connectedness: how many nodes we need to disconnect a graph (a system) - Verify points of failure
with discretized spaces - Allows to have all the (system) perspectives (of a node) available at the same time - Perspectives evolve with communication - Perspective = the view from a single node
way they represent spaces and in the continuous transformations that preserve properties. - Spaces made up of simple pieces for which essential properties can be characterized by counting, such as the sum of the degrees of the nodes in a graph. - Countable items allow combinations (interactions)
as (a set of) topological entities that are subject to (valid) subdivisions, analysis of the persistence and consistency of their interconnections (paths), offering a comprehensive set of states of the world
graph, it can also be described as a topological object (if the connections are preserved) Theorem: A topology on V is compatible with a graph G(V,E) if every induced subgraph of G is connected if and only if its vertex set is topologically connected (too).
connections and interactions (in terms of formal Connectivity) Get all the possible states of the world (use cases; paths) Once all the connections are topologically correct, we can say that the system is verified.
2. The Topology of shared-memory adversaries https://dl.acm.org/citation.cfm?doid=1835698.1835724 3. Distributed Computing Through Combinatorial Topology https://www.elsevier.com/books/distributed-computing-through-combinatorial-topolo gy/herlihy/978-0-12-404578-1