{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"non-comm-monads-adjoint-models","owner":"MonoidalAttackTrees","isFork":false,"description":"Non-Commutative Monads from Commutative/Non-Commutative Adjoint Models","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-02-28T17:05:11.815Z"}},{"type":"Public","name":"attack-trees-in-monoidal-cats","owner":"MonoidalAttackTrees","isFork":false,"description":"Project Repository: CRII: SHF: A New Foundation for Attack Trees Based on Monoidal Categories","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-02-04T15:31:18.894Z"}},{"type":"Public","name":"Attack-Tree-Petri-Nets","owner":"MonoidalAttackTrees","isFork":false,"description":"A New Model of Attack Trees in Petri Nets by Categorical Means","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-11-24T20:53:17.579Z"}},{"type":"Public","name":"Lina","owner":"MonoidalAttackTrees","isFork":false,"description":"A Haskell EDSL for conducting threat analysis using Attack Trees","allTopics":["edsl","verification","haskell-library","attack-trees","threat-analysis","linear-logic","maude","lina"],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":1,"starsCount":4,"forksCount":1,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-10-22T18:21:56.234Z"}},{"type":"Public","name":"ATLL-Formalization","owner":"MonoidalAttackTrees","isFork":false,"description":"Agda formalization of the Attack Tree Linear Logic","allTopics":["semantics","agda","attack-trees","categorical-semantics","linear-logic","categorical-logic","dialectica-spaces","dialectica-categories"],"primaryLanguage":{"name":"Agda","color":"#315665"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-29T15:34:16.603Z"}},{"type":"Public","name":"separating-linear-modalities","owner":"MonoidalAttackTrees","isFork":false,"description":"Separating the structural rules into several different modalities, and then relating them","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-05-26T17:21:43.072Z"}},{"type":"Public","name":"AttackTreeJSEditor","owner":"MonoidalAttackTrees","isFork":false,"description":"An editor for building attack trees written in Javascript.","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":5,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-04-25T16:35:46.583Z"}},{"type":"Public","name":"ILL-Impl","owner":"MonoidalAttackTrees","isFork":false,"description":"Implementation of a term assignment for intuitionistic linear logic","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":2,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2016-11-28T23:48:10.050Z"}}],"repositoryCount":8,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"MonoidalAttackTrees repositories"}